Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees

نویسندگان

  • William G. Golson
  • William C. Rounds
چکیده

A connection is established between the semantic theories of concurrency and communication in the works of de Bakker and Zucker, who develop a denotational semantics of concurrency using metric spaces instead of complete partial orders, and Milner, who develops an algebraic semantics of communication based upon observational equivalence between processes. His rigid synchronization trees (RSTs) are endowed with a simple pseudometric distance induced by Milner's weak equivalence relation and the quotient space is shown to be complete. An isometry between this space and the solution to a domain equation of de Bakker and Zucker is established, presenting their solution in a conceptually simpler framework. Under an additional assumption, the equivalence between the weak equivalence relation over RSTs and the elementary equivalence relation induced by the sentences of a modal logic due to Hennessy and Milner is established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON INTERRELATIONSHIPS BETWEEN FUZZY METRIC STRUCTURES

Considering the increasing interest in fuzzy theory and possible applications,the concept of fuzzy metric space concept has been introduced by severalauthors from different perspectives. This paper interprets the theory in termsof metrics evaluated on fuzzy numbers and defines a strong Hausdorff topology.We study interrelationships between this theory and other fuzzy theories suchas intuitionis...

متن کامل

On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces

Scott's theory of information systems (Scott, 1982) is intended to provide an easy way to define partial order structures (domains) for denotational semantics. This paper illustrates the new method by considering a simple modal logic, due to Hennessy and Milner (1980), as an example of an information system. The models of formulas in this logic are the rigid synchronization trees of Milner (198...

متن کامل

Some Results on Metric Trees

Using isometric embedding of metric trees into Banach spaces, this paper will investigate barycenters, type and cotype, and various measures of compactness of metric trees. A metric tree (T , d) is a metric space such that between any two of its points there is an unique arc that is isometric to an interval in R. We begin our investigation by examining isometric embeddings of metric trees into ...

متن کامل

Connections between labellings of trees

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.

متن کامل

On the Structure of Metric-like Spaces

The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Information and Control

دوره 57  شماره 

صفحات  -

تاریخ انتشار 1983